Structure of Gröbner bases with respect to block orders
نویسندگان
چکیده
In this paper we study the structure of Gröbner bases with respect to block orders. We extend Lazard’s theorem and the Gianni-Kalkbrenner theorem to the case of a zero-dimensional ideal whose trace in the ring generated by the first block of variables is radical. We then show that they do not hold for general zero-dimensional ideals.
منابع مشابه
Computing difference-differential dimension polynomials by relative Gröbner bases in difference-differential modules
In this paper we present a new algorithmic approach for computing the Hilbert function of a finitely generated difference-differential module equipped with the natural double filtration. The approach is based on a method of special Gröbner bases with respect to “generalized term orders” on Nm × Zn and on difference-differential modules. We define a special type of reduction for two generalized ...
متن کاملValue Monoids of Zero-dimensional Valuations of Rank One
Classically, Gröbner bases are computed by first prescribing a fixed monomial order. Moss Sweedler suggested an alternative in the mid 1980s and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build on these ideas by providing a class of valuations on K(x, y) that are suitable for this framework. We then perform such computations for i...
متن کاملValue monoids of zero-dimensional valuations of rank 1
Classically, Gröbner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build on these ideas by providing a class of valuations on k(x, y) that are suitable for this framework. For these valuations, we compute ν(k[x, y]∗) and use this ...
متن کاملGröbner bases and their application to the Cauchy problem on finitely generated affine monoids
For finitely generated submonoids of the integer lattice and submodules over the associated monoid algebra, we investigate Gröbner bases with respect to generalised term orders. Up to now, this theory suffered two disadvantages: The algorithm for computing the Gröbner bases was slow and it was not known whether there existed generalised term orders for arbitrary finitely generated submonoids. T...
متن کاملOn Arithmetical Formulas Whose Jacobians are Gröbner Bases
We exhibit classes of polynomials whose sets of first partial derivatives form Gröbner bases, with respect to all term orders. The classes are defined by syntactic constraints on arithmetical formulas defining the polynomials. Read-once formulas without constants also have this property, while those with constants have a weaker “Gröbner-bounding” property introduced here. The same properties ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 76 شماره
صفحات -
تاریخ انتشار 2007